﻿package DynamicProgramming;

/**
 * @ClassName LC746
 * @Description
 * @Author ZJX
 * @Date 2024/11/1 19:08
 * @Version 1.0
 */

public class LC746 {
    public int minCostClimbingStairs(int[] cost) {
       int n = cost.length;
       int[] dp = new int[n];  // dp[i] 表示 到达第i位置的最小花费
       dp[0] = 0;
       dp[1] = 0;

        for (int i = 2; i <= n; i++) {
            dp[i] = Math.min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2]);
        }
        return dp[n];
    }
}
